Convex games and feasible sets in control theory

نویسنده

  • Stefan Pickl
چکیده

The presented TEM-model describes the economical interaction between several actors (players) which intend to minimize their emissions (Ei) caused by technologies (Ti) by means of expenditures of money (Mi) or nancial means, respectively. The index stands for the i-th player, i = 1; : : : ; n. The players are linked by technical cooperations and the market, which expresses itself in the nonlinear time-discrete dynamics of the Technology-Emissions-Means-model, in short: TEMmodel. In the sense of environmental protection, the aim is to reach a state which is mentioned in the Kyoto Protocol by choosing the control parameters such that the emissions of each player become minimized. The focal point is the realization of the necessary optimal control parameters via a played cost game, which is determined by the way of cooperation of the actors. In application to the work of Leitmann, but not regarding solution sets as feasible sets, the -value of Tijs [13] is taken as a control parameter. This leads to a new class of problems in the area of 1-convex games. We want to solve the problem for a special case. With this solution a reasonable model for a Joint-Implementation process is developed, where its necessary fund is represented by the non-empty core of the analyzed game. Steering with parameters of this feasible set, the TEM-model can be regarded as a useful tool to implement and verify a technical Joint-Implementation Program. For the necessary data is given to the Clearing House, we are able to compare the numerical results with real world phenomena.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...

متن کامل

Solving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms

Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called  $lambda$–fuzzy measures. In this paper, we study a nonlinear optimization problem where the fea...

متن کامل

Cooperative games on convex geometries with a coalition structure

This paper is mainly to discuss cooperative games on convex geometries with a coalition structure, which can be seen as an extension of cooperative games with a coalition structure. For this kind of games, the cooperation among unions and within each union will be the convex sets, i.e., the feasible subsets of the coalition structure and that of each union belong to a convex geometry, respectiv...

متن کامل

Weights in block iterative methods

In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

متن کامل

Functionally closed sets and functionally convex sets in real Banach spaces

‎Let $X$ be a real normed  space, then  $C(subseteq X)$  is  functionally  convex  (briefly, $F$-convex), if  $T(C)subseteq Bbb R $ is  convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$  is  functionally   closed (briefly, $F$-closed), if  $T(K)subseteq Bbb R $ is  closed  for all bounded linear transformations $Tin B(X,R)$. We improve the    Krein-Milman theorem  ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Meth. of OR

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2001